Phase transitions in integer linear problems
نویسندگان
چکیده
منابع مشابه
Phase transitions in integer linear problems
The resolution of linear system with positive integer variables is a basic yet difficult computational problem with many applications. We consider sparse uncorrelated random systems parametrised by the density c and the ratio α = N/M between number of variables N and number of constraints M . By means of ensemble calculations we show that the space of feasible solutions endows a VanDer-Waals ph...
متن کاملTwo Problems in non-linear PDE’s with Phase Transitions
This thesis is in the field of non-linear partial differential equations (PDE), and specifically focusing on problems which show some type of phase-transition. One of the problems deals with a multiple phase Hele-Shaw flow. A single phase Hele-Shaw flow models a Newtoninan fluid which is being injected in the space between two narrowly separated parallel planes. The time evolution of the space ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملImproved Linear Integer Programming Formulations of Nonlinear Integer Problems*
A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer programming problem. However, the standard devices for doing this often produce an inordinate number of variables and constraints, putting the problem beyond the practical reach of available integer programming methods. This paper presents new formulation techniques for ...
متن کاملSolving Integer and Mixed Integer Linear Problems with ABS Method
Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory’s cuts) to narrow down the solution to the optimal integer solution. The ABS class of alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2017
ISSN: 1742-5468
DOI: 10.1088/1742-5468/aa85c3